A-statistical approximation by Jayasri operators

نویسنده

  • Nurhayat İspi̇r
چکیده

In this study we investigate the Astatistical approximation properties of a sequence of the Jayasri operators. Also we consider the degree of the A-statistical approximation of the sequence of these operators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation by $(p,q)$-Lupac{s} Stancu Operators

In this paper, $(p,q)$-Lupas Bernstein Stancu operators are constructed. Statistical as well as other approximation properties of $(p,q)$-Lupac{s} Stancu operators are studied. Rate of statistical convergence by means of modulus of continuity and Lipschitz type maximal functions has been investigated.

متن کامل

On the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators

In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...

متن کامل

Rough approximation operators based on quantale-valued fuzzy generalized neighborhood systems

Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Rate of A-statistical Approximation of a Modified Q-bernstein Operators (communicated by Professor

In this paper, we discuss properties of convergence for a modification of the q-Bernstein operators. Using the notion of A-statistical approximation, where A is a nonnegative regular summability matrix, we investigate the Korovkin type statistical approximation properties of this modification via A-statistical approximation. For 0 < q ≤ 1, we obtain that the q-Bernstein operators is A-statistic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003